A Method for Validating Multidimensional Fast Fourier Transform (FFT) Algorithms,
نویسندگان
چکیده
A method is described for validating fast Fourier transforms (FFTs) based on the use of simple input fiinctions whose discrete Fourier transforms can be evaluated in closed form. Explicit analytical results are developed for one-dimensional and two-dimensional discrete Fourier transforms. The analytical results are easily generalized to higher dimensions. The results offer a means for validating the FFT algorithm in one, two, or higher dimensional settings. The general motivation for the work comes from the need to validate the FFT algorithm when it is newly implemented on a computer or when new techniques or devices are added to a computer facility to evaluate discrete Fourier transforms.
منابع مشابه
Improving the RX Anomaly Detection Algorithm for Hyperspectral Images using FFT
Anomaly Detection (AD) has recently become an important application of target detection in hyperspectral images. The Reed-Xialoi (RX) is the most widely used AD algorithm that suffers from “small sample size” problem. The best solution for this problem is to use Dimensionality Reduction (DR) techniques as a pre-processing step for RX detector. Using this method not only improves the detection p...
متن کاملMultidimensional Index Mapping *
A change of index variable or an index mapping is used to uncouple the calculations of the discrete Fourier transform (DFT). This can result is a signi cant reduction in the required arithmetic and the resulting algorithm is called the fast Fourier transform (FFT). A powerful approach to the development of e cient algorithms is to break a large problem into multiple small ones. One method for d...
متن کاملReal-valued fast Fourier transform algorithms
This tutorial paper describes the methods for constructing fast algorithms for the computation of the discrete Fourier transform (DFT) of a real-valued series. The application of these ideas to all the major fast Fourier transform (FFT) algorithms is discussed, and the various algorithms are compared. We present a new implementation of the real-valued split-radix FFT, an algorithm that uses few...
متن کاملPathologies cardiac discrimination using the Fast Fourir Transform (FFT) The short time Fourier transforms (STFT) and the Wigner distribution (WD)
This paper is concerned with a synthesis study of the fast Fourier transform (FFT), the short time Fourier transform (STFT and the Wigner distribution (WD) in analysing the phonocardiogram signal (PCG) or heart cardiac sounds. The FFT (Fast Fourier Transform) can provide a basic understanding of the frequency contents of the heart sounds. The STFT is obtained by calculating the Fourier tran...
متن کاملFast algorithms of multidimensional discrete nonseparable -wave transforms
Fast algorithms for a wide class of non–separable n–dimensional (nD) discrete unitary K– transforms (DKT) are introduced. They need less 1D DKTs than in the case of the classical radix–2 FFT–type approach. The method utilizes a decomposition of the nDK–transform into the product of a new nD discrete Radon transform and of a set of parallel/independ 1D K–transforms. If the nD K–transform has a s...
متن کامل